Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering
نویسندگان
چکیده
منابع مشابه
Determinization in Monte-Carlo Tree Search for the card game
Monte-Carlo Tree Search (MCTS) is a class of game tree search algorithms that have recently proven successful for deterministic games of perfect information, particularly the game of Go. Determinization is an AI technique for making decisions in stochastic games of imperfect information by analysing several instances of the equivalent deterministic game of perfect information. In this paper we ...
متن کاملMonte Carlo Tree Search in Imperfect-Information Games Doctoral Thesis
Monte Carlo Tree Search (MCTS) is currently the most popular game playing algorithm for perfect-information extensive-form games. Its adaptation led, for example, to human expert level Go playing programs or substantial improvement of solvers for domain-independent automated planning. Inspired by this success, researchers started to adapt this technique also for imperfect-information games. Imp...
متن کاملMonte-Carlo Tree Search for the Game of "7 Wonders"
Monte-Carlo Tree Search algorithm, and in particular with the Upper Confidence Bounds formula, provided huge improvements for AI in numerous games, particularly in Go, Hex, Havannah, Amazons and Breakthrough. In this work we study this algorithm on a more complex game, the game of “7 Wonders”. This card game gathers together several known difficult features, such as hidden information, N-player...
متن کاملMonte-Carlo Tree Search for the Game of Scotland Yard1
This abstract describes how Monte-Carlo Tree Search (MCTS) [1, 4] can be applied to play the hideand-seek game Scotland Yard. This game is played by 6 players: 5 seekers and 1 hider. The seekers work together to capture the hider by moving one of their pawns to the location occupied by the hider. The game is played on a map consisting of 199 locations, connected by 4 different transportation ty...
متن کاملMonte-carlo Tree Search for the “mr Jack” Board Game
Recently the use of the Monte-Carlo Tree Search algorithm, and in particular its most famous implementation, the Upper Confidence Tree can be seen has a key moment for artificial intelligence in games. This family of algorithms provides huge improvements in numerous games, such as Go, Havannah, Hex or Amazon. In this paper we study the use of this algorithm on the game of Mr Jack and in particu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computational Intelligence and AI in Games
سال: 2012
ISSN: 1943-068X,1943-0698
DOI: 10.1109/tciaig.2012.2204883